On Some Questions of Hrbacek and Di Nasso
نویسندگان
چکیده
We answer the first two of the five questions posed by Mauro Di Nasso and Karel Hrbacek in their recent paper about combinatorial principles in nonstandard analysis.
منابع مشابه
Embeddability Properties of Difference Sets
By using nonstandard analysis, we prove embeddability properties of di↵erences A B of sets of integers. (A set A is “embeddable” into B if every finite configuration of A has shifted copies in B.) As corollaries of our main theorem, we obtain improvements of results by I.Z. Ruzsa about intersections of di↵erence sets, and of Jin’s theorem (as refined by V. Bergelson, H. Fürstenberg and B. Weiss...
متن کاملNonstandard Analysis and an Application to the Symmetric Group on Natural Numbers
An introduction of nonstandard analysis in purely algebraic terms is presented. As an application, we give a nonstandard proof of a characterization theorem for compact subsets of Sym(N).
متن کاملSlow P -point Ultrafilters
We answer a question of Blass, Di Nasso, and Forti [2, 7] by proving, assuming Continuum Hypothesis or Martin’s Axiom, that (1) there exists a P -point which is not interval-to-one and (2) there exists an interval-to-one P -point which is neither quasi-selective nor weakly Ramsey.
متن کاملThe generic filter property in nonstandard analysis
In this paper two new combinatorial principles in nonstandard analysis are isolated and applications are given. The second principle provides an equivalent formulation of Henson’s isomorphism property.
متن کاملIntersections of Shifted Sets
We consider shifts of a set A ⊆ N by elements from another set B ⊆ N, and prove intersection properties according to the relative asymptotic size of A and B. A consequence of our main theorem is the following: If A = {an} is such that an = o(n k/k−1), then the k-recurrence set Rk(A) = {x | |A∩ (A+ x)| > k} contains the distance sets of some arbitrarily large finite sets.
متن کامل